Connection Calculus Theorem Proving with Multiple Built-in Theories
نویسندگان
چکیده
منابع مشابه
On Theorem-Proving in Horn Theories with Built-in Algebras
We present a semi-decision procedure to prove ground theorems in Horn theories with built-in algebras. This is a maximal-unit-strategy based method, i.e in all our inference rules at least one of the premises clauses is an unit one. As in 4], constraint formalism is used as well ; but more general speciications are studied. To limit the search space, an rpo-like ordering is used. Neither uniica...
متن کاملTheorem Proving with Structured Theories
Motivated by the problem of query answering over multiple structured commonsense theories, we exploit graph-based techniques to improve the efficiency of theorem proving for structured theories. Theories are organized into subtheories that are minimally connected by the literals they share. We present message-passing algorithms that reason over these theories using consequence finding, speciali...
متن کاملTheorem Proving in Large Theories
This paper investigates the performance of automated theo rem provers in formal software veri cation The challenge for the provers in this application is the large number of up to several hundred axioms in typical software speci cations Both the success rates and the proof times strongly depend on how good the provers are able to nd out the few relevant axioms that are really needed in the proo...
متن کاملConnection-Driven Inductive Theorem Proving
We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional subst...
متن کاملA Model Elimination Calculus with Built-in Theories (Extended Abstract)
The model elimination calculus is a linear, refutationally complete calculus for rst order clause logic. We show how to extend this calculus with a framework for theory reasoning. Theory reasoning means to separate the knowledge of a given domain or theory and treat it by special purpose inference rules. We present two versions of theory model elimination: the one is called total theory model e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2000
ISSN: 0747-7171
DOI: 10.1006/jsco.1999.0365